#include <stdio.h>

unsigned long long fibonacci_recursive(unsigned int n) {
    if (n == 0) return 0;
    if (n == 1) return 1;
    return fibonacci_recursive(n - 1) + fibonacci_recursive(n - 2);
}

void print_fibonacci(unsigned int n) {
    for (unsigned int i = 0; i < n; i++) {
        printf("%llu", fibonacci_recursive(i));
        if (i < n - 1) printf(", ");
    }
    printf("\n");
}

int main() {
    unsigned int n;
    printf("请输入要输出的斐波那契数列的项数: ");
    scanf("%u", &n);
    print_fibonacci(n);
    return 0;
}